Automata construction

Results: 60



#Item
11Formal methods / Büchi automaton / Ω-automaton / Linear temporal logic / SIGNAL / Powerset construction / Automata theory / Theoretical computer science / Computer science

Synthesis of Reactive Systems Jens Regenberg <> IV

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2008-09-23 06:27:20
12Applied mathematics / Nondeterministic finite automaton / Powerset construction / Deterministic finite automaton / Regular expression / Finite-state machine / Regular language / Symbol / String / Automata theory / Theoretical computer science / Computer science

Models of Computation Lecture 4: Nondeterministic Automata [Fa’14] Caveat lector! This is the first edition of this lecture note. Some topics are incomplete, and there are almost certainly a few serious errors. Please

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:05:08
13Formal languages / Computing / Automata theory / Models of computation / Parsing / Lexical analysis / Context-free grammar / Parse tree / Regular expression / Programming language implementation / Software engineering / Compiler construction

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

Add to Reading List

Source URL: repository.readscheme.org

Language: English - Date: 2012-08-10 19:25:37
14Applied mathematics / Factor oracle / Finite-state machine / SC / Automata construction / Automaton / LL parser / Nested word / Deterministic pushdown automaton / Automata theory / Theoretical computer science / Computer science

Oracle Pushdown Automata for Trees in Prefix Notation

Add to Reading List

Source URL: www.dcs.kcl.ac.uk

Language: English - Date: 2010-02-18 04:52:05
15Formal methods / Powerset construction / Finite-state machine / Nondeterministic finite automaton / Automata theory / Theoretical computer science / Computer science

CS109B Notes for LectureAutomata Systems often may be modeled by a nite set of states.  The system is always in one state.

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:51
16Combinatorics / Mathematics / Regular expression / Regular language / String / Powerset construction / Concatenation / Finite-state machine / Deterministic finite automaton / Formal languages / Automata theory / Theoretical computer science

CS109B Notes for LectureNondeterministic Automata Looking for Substrings We can build an NFA to recognize a string that ends in any given substring a1a2 a if we:

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:53
17Algebra / Differential geometry / Symbol / Forcing / Skew-symmetric matrix / Ordinary differential equations / Spectral theory / Spectral theory of ordinary differential equations / Theorems and definitions in linear algebra / Mathematics / Mathematical analysis / Matrices

Dynamical Systems and Their Associated Automata R. W. Brockett Abstract This paper studies problems related to the construction of a robust correspondence between an automaton and a continuous-time dynamical system of th

Add to Reading List

Source URL: hrl.harvard.edu

Language: English - Date: 2003-11-28 20:11:43
18Theoretical computer science / Computer science / Finite-state machine / Deterministic finite automaton / State diagram / State transition table / State transition system / Models of computation / Theory of computation / Automata theory

software construction Editors: Andy Hunt and Dave Thomas ■ The Pragmatic Programmers a n d y @ p r a g m a t i c p r o g r a m m e r. c o m ■ d a v e @ p r a g m a t i c p r o g r a m m e r. c o m State Machines Dave

Add to Reading List

Source URL: media.pragprog.com

Language: English - Date: 2007-10-31 17:44:24
19Formal languages / Computing / Automata theory / Models of computation / Parsing / Lexical analysis / Context-free grammar / Parse tree / Regular expression / Programming language implementation / Software engineering / Compiler construction

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

Add to Reading List

Source URL: www.schemeworkshop.org

Language: English - Date: 2011-08-12 16:48:41
20Finite state transducer / Finite-state machine / Speech recognition / Computer science / Mathematical optimization / Applied mathematics / Computing / Automata theory / Models of computation / Computational linguistics

Direct Construction of Compact Context-Dependency Transducers From Data David Rybach∗ Michael Riley Human Language Technology

Add to Reading List

Source URL: wiki.inf.ed.ac.uk

Language: English - Date: 2010-11-05 06:38:47
UPDATE